Landau–Ginzburg/Calabi–Yau Correspondence for a Complete Intersection via Matrix Factorizations

نویسندگان

چکیده

Abstract By generalizing the Landau–Ginzburg/Calabi–Yau correspondence for hypersurfaces, we can relate a Calabi–Yau complete intersection to hybrid Landau–Ginzburg model: family of isolated singularities fibered over projective line. In recent years Fan, Jarvis, and Ruan have defined quantum invariants this type, Clader Clader–Ross provided an equivalence between these Gromov–Witten intersections, in way cohomology yields identification groups model. It is not clear how known isomorphism descending from derived equivalences (due Segal Shipman, Orlov Isik). We answer question intersections two cubics.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix Factorizations for Complete Intersections and Minimal Free Resolutions

Matrix factorizations of a hypersurface yield a description of the asymptotic structure of minimal free resolutions over the hypersurface, and also define a functor to the stable module category of maximal Cohen-Macaulay modules on the hypersurface. We introduce a new functorial concept of matrix factorizations for complete intersections that allows us to describe the asymptotic structure of mi...

متن کامل

Collaborative Filtering via Ensembles of Matrix Factorizations

We present a Matrix Factorization (MF) based approach for the Netflix Prize competition. Currently MF based algorithms are popular and have proved successful for collaborative filtering tasks. For the Netflix Prize competition, we adopt three different types of MF algorithms: regularized MF, maximum margin MF and non-negative MF. Furthermore, for each MF algorithm, instead of selecting the opti...

متن کامل

Riordan group approaches in matrix factorizations

In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.

متن کامل

Nonnegative Matrix Factorizations for Clustering: A Survey

Recently there has been significant development in the use of non-negative matrix factorization (NMF) methods for various clustering tasks. NMF factorizes an input nonnegative matrix into two nonnegative matrices of lower rank. Although NMF can be used for conventional data analysis, the recent overwhelming interest in NMF is due to the newly discovered ability of NMF to solve challenging data ...

متن کامل

Factorizations of complete multigraphs

In this paper, several general results are obtained on the Oberwolfach problem that provide isomorphic 2-factorizations of 2Kn. One consequence of these results is that the existence of a 2-factorization in which each 2-factor of 2Kn consists of one cycle of length x and one of length n-x is completely settled. The techniques used to obtain these results are novel, using for example the Lindner...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2021

ISSN: ['1687-0247', '1073-7928']

DOI: https://doi.org/10.1093/imrn/rnab044